Generalized attribute reduct in rough set theory

نویسندگان

  • Xiuyi Jia
  • Lin Shang
  • Bing Zhou
  • Yiyu Yao
چکیده

Attribute reduction plays an important role in the areas of rough sets and granular computing. Many kinds of attribute reducts have been defined in previous studies. However, most of them concentrate on data only, which result in the difficulties of choosing appropriate attribute reducts for specific applications. It would be ideal if we could combine properties of data and user preference in the definition of attribute reduct. In this paper, based on reviewing existing definitions of attribute reducts, we propose a generalized attribute reduct which not only considers the data but also user preference. The generalized attribute reduct is the minimal subset which satisfies a specific condition defined by users. The condition is represented by a group of measures and a group of thresholds, which are relevant to user requirements or real applications. For the same data, different users can define different reducts and obtain their interested results according to their applications. Most current attribute reducts can be derived from the generalized reduct. Several reduction approaches are also summarized to help users to design their appropriate reducts. © 2015 Published by Elsevier B.V.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Attribute Reduction using Forward Selection and Relative Reduct Algorithm

Attribute reduction of an information system is a key problem in rough set theory and its applications. Rough set theory has been one of the most successful methods used for feature selection. Rough set is one of the most useful data mining techniques. This paper proposes relative reduct to solve the attribute reduction problem in roughest theory. It is the most promising technique in the Rough...

متن کامل

Sampling for Approximate Reduct in very Large Datasets

The rough set theory provides a formal framework for data mining. Reduct is the most important concept in rough set application to data mining. A reduct is the minimal attribute set preserving classification power of original dataset. Finding a reduct is similar to feature selection problem. In this paper, we propose two reduct algorithms. One is based on attribute frequency in discernibility m...

متن کامل

Feature ranking in rough sets

We propose a novel feature ranking technique using discernibility matrix. Discernibility matrix is used in rough set theory for reduct computation. By making use of attribute frequency information in discernibility matrix, we develop a fast feature ranking mechanism. Based on the mechanism, two heuristic reduct computation algorithms are proposed. One is for optimal reduct and the other for app...

متن کامل

A relational perspective of attribute reduction in rough set-based data analysis

0377-2217/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.ejor.2010.08.017 ⇑ Corresponding author. Tel.: +886 2 27883799. E-mail addresses: [email protected] (T.-F. Fan), Liau), [email protected] (D.-R. Liu). Attribute reduction is very important in rough set-based data analysis (RSDA) because it can be used to simplify the induced decision rules without reducing the classification accu...

متن کامل

Dimension Reduction Using Rough Set Theory For Intrusion Detection System

This paper briefly describes Information Detection System management by reducing dimension of the information system(IS) for network traffic both row wise and column wise. For dimension reduction, Rough Set Theory (RST) is used where determination of reduct and core plays a major role. But finding reduct is difficult task for a huge IS. Our paper suggests a technique where we propose to divide ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Knowl.-Based Syst.

دوره 91  شماره 

صفحات  -

تاریخ انتشار 2016